Synchronous composition of interval weighted automata
نویسندگان
چکیده
Interval weighted automata are introduced as automata with weights in a product dioid (idempotent semiring). They constitute an extension of (max,+) automata since they enable us to model temporal constraints (instead of exact durations) for transitions. Their synchronous composition, which coincides with the synchronous product of underlying (one clock) timed automata, results in multi-event interval weighted automata, whose behaviors are studied. Our approach is illustrated by an example.
منابع مشابه
Synchronous composition of interval weighted automata using tensor algebra of product semirings
Interval weighted automata are introduced as automata with weights in a product dioid (idempotent semiring). They constitute an extension of (max,+) automata since they enable us to model temporal constraints (instead of exact durations) for transitions. Their synchronous composition, that coincides with the synchronous product of underlying (one clock) timed automata, results in multi-event in...
متن کاملModelling Asynchrony with a Synchronous Model
The I/O Automaton paradigm of Lynch and Tuttle models asynchrony through an in-terleaving parallel composition and generalizes more common interleaving models based upon message-passing, such as Hoare's CSP. It is not generally recognized that such inter-leaving models in fact can be viewed as special cases of synchronous parallel composition, in which components all move in lock-step. Let A be...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملIntersecting Hierarchical and Phrase-Based Models of Translation: Formal Aspects and Algorithms
We address the problem of constructing hybrid translation systems by intersecting a Hiero-style hierarchical system with a phrase-based system and present formal techniques for doing so. We model the phrase-based component by introducing a variant of weighted finite-state automata, called σ-automata, provide a self-contained description of a general algorithm for intersecting weighted synchrono...
متن کاملWeighted Finite-State Transducer Algorithms An Overview
Weighted finite-state transducers are used in many applications such as text, speech and image processing. This chapter gives an overview of several recent weighted transducer algorithms, including composition of weighted transducers, determinization of weighted automata, a weight pushing algorithm, and minimization of weighted automata. It briefly describes these algorithms, discusses their ru...
متن کامل